New bounds on the signed total domination number of graphs

In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥ 2. Applying the concept of total limited packing we bound the signed total domination number of G with δ(G) ≥ 3 from above by n−2b 2ρo(G)+δ−3 2 c. Also, we prove that γst(T ) ≤ n− 2(s− s′) for any tree T of order n, with s support vertices and s′ support vertices of degree two. Moreover, we characterize all trees attaining this bound. ∗corresponding author 1 ar X iv :1 50 2. 02 80 8v 1 [ m at h. C O ] 1 0 Fe b 20 15